CNF Instances from the Software Package Installation Problem⋆
نویسندگان
چکیده
The complexity of software package installations poses a number of key challenges. Very often it is not possible to install all the desired packages and a variety of solutions can be thought of. Recent work has suggested the optimization of a user-provided objective function. The present work aims at characterizing the CNF instances resulting from the software package installation problem. Starting from a basic configuration, different installations have been generated by adding a subset of the most popular packages. We have studied the hardness of satisfiable and unsatisfiable instances, as well as the unsatisfiable cores of the unsatisfiable instances and the maximum number of packages that can be installed when the instance is unsatisfiable. The obtained results shed additional light on optimization criteria to solve installation conflicts.
منابع مشابه
Automated software packaging and installation for the ATLAS experiment
Managing the distribution and installation of large and complex software suites such as that of the ATLAS Particle Physics experiment [1] gives rise to a variety of problems. To be able to deploy software on the Grid it must have a completely automated installation procedure that addresses issues such compatibility, updates and external software required. Installations are needed to satisfy the...
متن کاملEffective CNF Encodings for the Towers of Hanoi
One of the most well-known CNF benchmark encodes the problem of the Towers of Hanoi. This benchmark is available from SATlib and has been part of the set of problem instances used in more than one edition of the SAT competition. The existing CNF instances build upon an encoding using the STRIPS language. Although the available instances (ranging from 4 to 6 disks) are hard to solve for most of ...
متن کاملAn Approach for Secure Software Installation
We present an approach that addresses the problem of securing software configurations from the security-relevant actions of poorly built/faulty installation packages. Our approach is based on a policy-based control of the package manager’s actions and is customizable for site-specific policies. We discuss an implementation of this approach in the context of the Linux operating system for the Re...
متن کاملA Fixed-Parameter Algorithm for Random Instances of Weighted d-CNF Satisfiability
We study random instances of the weighted d-CNF satisfiability problem (WEIGHTED dSAT), a generic W[1]-complete problem. A random instance of the problem consists of a fixed parameter k and a random d-CNF formula F k,d generated as follows: for each subset of d variables and with probability p, a clause over the d variables is selected uniformly at random from among the 2 − 1 clauses that conta...
متن کاملPBS: A Backtrack-Search Pseudo-Boolean Solver and Optimizer
Optimized solvers for the Boolean Satisfiability (SAT) problem [5, 14, 15, 17, 19, 23, 24] found many applications in areas such as hardware and software verification, FPGA routing, planning in AI, etc. Further uses are complicated by the need to express “counting constraints” in conjunctive normal form (CNF). Expressing such constraints by pure CNF leads to more complex SAT instances. Alternat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008